Subspace ensemble learning via totally-corrective boosting for gait recognition
نویسندگان
چکیده
Human identification at a distance has recently become a hot research topic in the fields of computer vision and pattern recognition. Gait recognition has most widely been studied to address this problem, because gait patterns can operate from a distance without subject cooperation. In this paper, a local patch-based subspace ensemble learning method for gait recognition is proposed. This method first incrementally selects the most efficient local patches from which local patch-based subspaces are learned to preserve the proximity relationships among instance triplets: instance i is closer to instance j than to instance k. Then these subspaces are combined to generate an accurate and robust classifier in the totally-corrective boosting framework. Unlike existing triplets based metric learning which is generally not able to deal with the high-dimensional data, the proposed method uses local information instead of global data to guarantee the feasibility of computation, and then the effective implementation method is proposed. To further improve recognition performance, Gabor wavelet-based feature pools are built for training the classifier. We compare the proposed method with the recently Appearing in Proceedings of the 30 th International Conference on Machine Learning, Georgia, Atlanta, USA, 2013. Copyright 2013 by the author(s)/owner(s). published gait recognition approaches on USF HumanID Database. Experimental results indicate that the proposed method achieves highly competitive performance against the state-of-the-art gait recognition approaches.
منابع مشابه
Face Recognition with the Multiple Constrained Mutual Subspace Method
In this paper, we propose a novel method named the Multiple Constrained Mutual Subspace Method which increases the accuracy of face recognition by introducing a framework provided by ensemble learning. In our method we represent the set of patterns as a low-dimensional subspace, and calculate the similarity between an input subspace and a reference subspace, representing learnt identity. To ext...
متن کاملBoosting Constrained Mutual Subspace Method for Robust Image-Set Based Object Recognition
Object recognition using image-set or video sequence as input tends to be more robust since image-set or video sequence provides much more information than single snap-shot about the variability in the appearance of the target subject. Constrained Mutual Subspace Method (CMSM) is one of the state-of-the-art algorithms for imageset based object recognition by first projecting the image-set patte...
متن کاملAsymmetric Totally-Corrective Boosting for Real-Time Object Detection
Real-time object detection is one of the core problems in computer vision. The cascade boosting framework proposed by Viola and Jones has become the standard for this problem. In this framework, the learning goal for each node is asymmetric, which is required to achieve a high detection rate and a moderate false positive rate. We develop new boosting algorithms to address this asymmetric learni...
متن کاملTotally Corrective Boosting with Cardinality Penalization
We propose a totally corrective boosting algorithm with explicit cardinality regularization. The resulting combinatorial optimization problems are not known to be efficiently solvable with existing classical methods, but emerging quantum optimization technology gives hope for achieving sparser models in practice. In order to demonstrate the utility of our algorithm, we use a distributed classic...
متن کاملTotally Corrective Multiclass Boosting with Binary Weak Learners
In this work, we propose a new optimization framework for multiclass boosting learning. In the literature, AdaBoost.MO and AdaBoost.ECC are the two successful multiclass boosting algorithms, which can use binary weak learners. We explicitly derive these two algorithms’ Lagrange dual problems based on their regularized loss functions. We show that the Lagrange dual formulations enable us to desi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Neurocomputing
دوره 224 شماره
صفحات -
تاریخ انتشار 2017